Pomset Languages of Finite Step Transition Systems
نویسندگان
چکیده
Context Subsets of nitely generated free monoids [Kleene][Büchi].. : MSO denability ⇔ algebraic recognizability ⇔ nite device acceptance ⇔ rational expressions.
منابع مشابه
Regular Sets of Pomsets with Autoconcurrency
Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we...
متن کاملEvent Correlation with Boxed Pomsets
This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels and then synchronization with an observation. This paper first proposes a new model called boxed pomset languages, which extends classical pomset-based languages as so called High-level Message Sequence Charts. It can...
متن کاملRecognizability of Pomset Languages with Event Reenement
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognizable pomset languages have extended closur...
متن کاملA Syntactic Congruence for theRecognizability of Pomset Languages
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognisable pomset languages have extended closur...
متن کاملCompleteness Theorems for Pomset Languages and Concurrent Kleene Algebras
Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered rather than totally ordered. A term t using the bi-Kleene operations 0, 1,+, · , , ‖,(∗) defines a set [[t]] of pomsets in a natural way. We prove that every valid universal equality over pomset languages using these operations is a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009